Efficient Adaptive Algorithms for Transposing Small and Large Matrices on Symmetric Multiprocessors
نویسندگان
چکیده
منابع مشابه
Efficient Adaptive Algorithms for Transposing Small and Large Matrices on Symmetric Multiprocessors
Matrix transpose in parallel systems typically involves costly all-to-all communications. In this paper, we provide a comparative characterization of various efficient algorithms for transposing small and large matrices using the popular symmetric multiprocessors (SMP) architecture, which carries a relatively low communication cost due to its large aggregate bandwidth and lowlatency inter-proce...
متن کاملDesigning Practical Efficient Algorithms for Symmetric Multiprocessors
Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of eecient parallel algorithms for this platform currently poses several challenges. In this paper, we present a computational model for designing eecient algorithms for symmetric multiprocessors. We then use this model...
متن کاملDesigning Practical Eecient Algorithms for Symmetric Multiprocessors
Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of eecient parallel algorithms for this platform currently poses several challenges. In this paper, we present a computational model for designing eecient algorithms for symmetric multiprocessors. We then use this model...
متن کاملEfficient randomized algorithms for adaptive low-rank factorizations of large matrices
In this paper, randomized techniques for computing low-rank factorizations are presented. The proposed methods take in a tolerance ε and an m × n matrix A, and output an approximate low-rank factorization of A, whose error measured in the Frobenius norm is within ε. The techniques are based on the blocked randQB scheme proposed by P.-G. Martinsson and S. Voronin, producing a QB factorization. B...
متن کاملEfficient Computation of the Maximum Eigenvalue of Large Symmetric Matrices
Though the implicitly restarted Arnoldi/Lanczos method in ARPACK is a reliable method for computing a few eigenvalues of large-scale matrices, it can be inefficient because it only checks for convergence at restarts. Significant savings in runtime can be obtained by checking convergence at each Lanczos iteration. We describe a new convergence test for the maximum eigenvalue that is numerically ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatica
سال: 2006
ISSN: 0868-4952,1822-8844
DOI: 10.15388/informatica.2006.153